Parallel computation on 2-3-trees

Parallel Computation on 2-3-Trees

— Our model of computation is a parallel computer with k synchronized processors Pu . . . , Pk sharing a common random access storage, where simultaneous access to the same storage location by two or more processors is not allowed. Suppose a 2-3 tree Twith n leaves is implemented in the storage, suppose au ..., ak are data that may or may not be stored in the leaves, suppose ö! ̂ . . . ^ak and f...

Parallel Dictionaries in 2-3 Trees

Our model of computation is a parallel computer with k synchronized processors PI,...,Pk sharing a common random access storage, where simultaneous access to the same storage location by two or more processors is not allowed. Suppose a 2-3 tree T with n leaves is implemented in the storage, suppose al,...,a k are data that may or may not be stored in the leaves, and for all i, 1 4 i 4 k, proces...

Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees

We are interested in the fringe analysis of synchronized parallel insertion algorithms on 2{3 trees, namely the algorithm of W. Paul, U. Vishkin and H. Wagener (PVW). This algorithm inserts k keys into a tree of size n with parallel time O(log n + log k). Fringe analysis studies the distribution of the bottom subtrees and it is still an open problem for parallel algorithms on search trees. To t...

Parallel computation of phylogenetic consensus trees

The field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular sequence data, predominantly driven by novel wet-lab sequencing techniques. This trend poses scalability challenges for tool developers. In the field of phylogenetic inference (reconstruction of evolutionary trees from molecular sequence data), scalability is becoming an increasingly important issue for...

A Fast Parallel Merging Algorithm for 2-3 trees